Uses of Class
negotiator.analysis.BidPoint

Packages that use BidPoint

negotiator.analysis

Uses of BidPoint in negotiator.analysis

Subclasses of BidPoint in negotiator.analysis

class

BidPointTime Specialized version of a BidPoint for the case that there are two agents.

Fields in negotiator.analysis with type parameters of type BidPoint

java.util.ArrayList<BidPoint>

BidSpace.bidPoints List of all bidpoints in the domain.

Methods in negotiator.analysis that return BidPoint

BidPoint	BidSpace.getKalaiSmorodinsky() Calculates Kalai-Smorodinsky optimal outcome.
BidPoint	BidSpace.getNash() Calculates the undiscounted Nash optimal outcome.
BidPoint	BidSpace.getNearestBidPoint(double utilA, double utilB, double weightA, double weightB, java.util.ArrayList<Bid> excludeList) Finds the bid with the minimal distance weightA*DeltaUtilA^2+weightB*DeltaUtilB^2 where DeltaUtilA is the difference between given utilA and the actual utility of the bid.

Methods in negotiator.analysis that return types with arguments of type BidPoint

java.util.List<BidPoint>	ParetoFrontier.getFrontier() Returns the Pareto-optimal frontier.
java.util.List<BidPoint>	BidSpace.getParetoFrontier() Returns the Pareto fronier.

Methods in negotiator.analysis with parameters of type BidPoint

int	BidPointSorterB.compare(BidPoint b1, BidPoint b2) Comperator.
int	BidPointSorterA.compare(BidPoint b1, BidPoint b2) Comperator.
double	BidSpace.distanceToNearestParetoBid(BidPoint bid) Method which given a bid point determines the distance to the nearest Pareto-optimal bid.
double	BidPoint.getDistance(BidPoint other) Returns the distance between this BidPoint and another BidPoint.
boolean	ParetoFrontier.isBelowFrontier(BidPoint bid) Returns true if the given BidPoint is not part of the Pareto-frontier.
boolean	BidPoint.isStrictlyDominatedBy(BidPoint other) Returns true if this BidPoint is strictly dominated by another BidPoint.
void	ParetoFrontier.mergeIntoFrontier(BidPoint bidpoint) Determines if a bid should be added to the Pareto-frontier.